Programming Languages Capturing Complexity Classes
نویسندگان
چکیده
We investigate an imperative and a functional programming language. The computational power of fragments of these languages induce two hierarchies of complexity classes. Our first main theorem says that these hierarchies match, level by level, a complexity-theoretic alternating space-time hierarchy known from the literature. Our second main theorems says that a slightly different complexity-theoretic hierarchy (the Goerdt-Seidl hierarchy) also can be captured by hierarchies induced by fragments of the programming languages. Well known complexity classes like , , , , etc., occur in the hierarchies. ACM CCS
منابع مشابه
On the Expressiveness of Essence
Development of languages for specifying or modelling problems is an important direction in constraint modelling. To provide greater abstraction and modelling convenience, these languages are becoming more syntactically rich, leading to a variety of questions about their expressive power. In this paper, we consider the expressiveness of Essence, a specification language with a rich variety of sy...
متن کاملLogic Column 9 Programming Languages Capturing Complexity Classes*
In recent years there has been a growing interest in programming languages with the property that all definable functions belong to some complexity class, often polynomial time or space. This research has established a link between computational complexity theory and the fields of type systems and programming language semantics with emerging applications to resource certification and programmin...
متن کاملThe Implicit Computational Complexity of Imperative Programming Languages
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit computational complexity, i.e. the theory of predicative recursion, tiered definition schemes, etcetera. We extend and modify this theory to work in a context of imperative programming languages, and characterise complexity classes like P, linspace, pspace and the classes in the Grzegorczyk hiearch...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملLogspace and Logtime Leaf Languages
The computation tree of a nondeterministic machine M with input x gives rise to a leaf string formed by concatenating the outcomes of all the computations in the tree in lexicographical order. We may characterize problems by considering, for a particular \leaf language" Y , the set of all x for which the leaf string of M is contained in Y . In this way, in the context of polynomial time computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nord. J. Comput.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005